Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPAW/3RNAQPP
Repositorysid.inpe.br/sibgrapi/2018/08.28.19.11
Last Update2018:08.28.19.11.31 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2018/08.28.19.11.31
Metadata Last Update2022:06.14.00.09.10 (UTC) administrator
DOI10.1109/SIBGRAPI.2018.00027
Citation KeyFaccinVernierCombTele:2018:StGrIn
TitleA Stable Greedy Insertion Treemap Algorithm for Software Evolution Visualization
FormatOn-line
Year2018
Access Date2024, Apr. 27
Number of Files1
Size5022 KiB
2. Context
Author1 Faccin Vernier, Eduardo
2 Comba, Joao
3 Telea, Alexandru C.
Affiliation1 UFRGS and RUG
2 UFRGS
3 RUG
EditorRoss, Arun
Gastal, Eduardo S. L.
Jorge, Joaquim A.
Queiroz, Ricardo L. de
Minetto, Rodrigo
Sarkar, Sudeep
Papa, João Paulo
Oliveira, Manuel M.
Arbeláez, Pablo
Mery, Domingo
Oliveira, Maria Cristina Ferreira de
Spina, Thiago Vallin
Mendes, Caroline Mazetto
Costa, Henrique Sérgio Gutierrez
Mejail, Marta Estela
Geus, Klaus de
Scheer, Sergio
e-Mail Addressefvernier@gmail.com
Conference NameConference on Graphics, Patterns and Images, 31 (SIBGRAPI)
Conference LocationFoz do Iguaçu, PR, Brazil
Date29 Oct.-1 Nov. 2018
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2018-08-28 19:11:31 :: efvernier@gmail.com -> administrator ::
2022-06-14 00:09:10 :: administrator -> :: 2018
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsTreemap
Dynamic
AbstractComputing treemap layouts for time-dependent (dynamic) trees is an open problem in information visualization. In particular, the constraints of spatial quality (cell aspect ratio) and stability (small treemap changes mandated by given tree-data changes) are hard to satisfy simultaneously. Most existing treemap methods focus on spatial quality, but are not inherently designed to address stability. We propose here a new treemapping method that aims to jointly optimize both these constraints. Our method is simple to implement, generic (handles any types of dynamic hierarchies), and fast. We compare our method with 14 state of the art treemaping algorithms using four quality metrics, over 28 dynamic hierarchies extracted from evolving software codebases. The comparison shows that our proposal jointly optimizes spatial quality and stability better than existing methods.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2018 > A Stable Greedy...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > A Stable Greedy...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 28/08/2018 16:11 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPAW/3RNAQPP
zipped data URLhttp://urlib.net/zip/8JMKD3MGPAW/3RNAQPP
Languageen
Target FilePaper ID 23.pdf
User Groupefvernier@gmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3RPADUS
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2018/09.03.20.37 9
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close